Decomposition Methods for the Travelling Purchaser Problem
نویسندگان
چکیده
منابع مشابه
Logic-Based Decomposition Methods for the Travelling Purchaser Problem
We present novel branch-and-check and logic-based Benders decomposition techniques for the Travelling Purchaser Problem, an important optimization problem with applications in vehicle routing, logistics, and warehouse management. Our master problem determines a set of markets and directed travel arcs that satisfy product purchase constraints with relaxed travel costs. Our subproblem identifies ...
متن کاملDistributed Parallel Metaheuristics based on GRASP and VNS for Solving the Traveling Purchaser Problem
We intend to show in this paper that metaheuristics based on GRASP and VNS can give good results for a generalization of the Traveling Salesman Problem (TSP) called Traveling Purchaser Problem (TPP) when compared with the Tabu Search algorithm proposed by Voss [13] for this algorithm, concerning the quality of solutions in similar execution times. In these algorithms, several simple and well kn...
متن کاملA heuristic approach for the Travelling Purchaser Problem
The Travelling Purchaser Problem (TPP) is a known generalization of the Travelling Salesman Problem, and is defined as follows. Let us consider a set of products and a set of markets. Each market is provided with a limited amount of each product at a known price. The TPP consists in selecting a subset of markets such that a given demand of each product can be purchased, minimizing the routing c...
متن کاملApproximation Algorithms for the Traveling Purchaser Problem and its Variants in Network Design
The traveling purchaser problem is a generalization of the traveling salesman problem with applications in a wide range of areas including network design and scheduling The input consists of a set of markets and a set of products Each market o ers a price for each product and there is a cost associated with traveling from one market to another The problem is to purchase all products by visiting...
متن کاملApproximation Algorithms for the TravelingPurchaser Problem and its Variants in
The traveling purchaser problem is a generalization of the traveling salesman problem with applications in a wide range of areas including network design and scheduling. The input consists of a set of markets and a set of products. Each market ooers a price for each product and there is a cost associated with traveling from one market to another. The problem is to purchase all products by visit...
متن کامل